Primal-dual interior-point methods for PDE-constrained optimization

نویسندگان

  • Michael Ulbrich
  • Stefan Ulbrich
چکیده

Abstract. This paper provides a detailed analysis of a primal-dual interior-point method for PDE-constrained optimization. Considered are optimal control problems with control constraints in L. It is shown that the developed primal-dual interior-point method converges globally and locally superlinearly. Not only the easier L-setting is analyzed, but also a more involved L-analysis, q < ∞, is presented. In L, the set of feasible controls contains interior points and the Fréchet differentiability of the perturbed optimality system can be shown. In the L-setting, which is highly relevant for PDE-constrained optimization, these nice properties are no longer available. Nevertheless, a convergence analysis is developed using refined techniques. In particular, two-norm techniques and a smoothing step are required. The L-analysis with smoothing step yields global linear and local superlinear convergence, whereas the L-analysis without smoothing step yields only global linear convergence.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Function space interior point methods for PDE constrained optimization

A primal-dual interior point method for optimal control problems with PDE constraints is considered. The algorithm is directly applied to the infinite dimensional problem. Existence and convergence of the central path are analyzed. Numerical results from an inexact continuation method applied to a model problem are shown. AMS MSC 2000: 49M15, 90C48, 90C51

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

Path-following primal-dual interior-point methods for shape optimization of stationary flow problems

We consider shape optimization of Stokes flow in channels where the objective is to design the lateral walls of the channel in such a way that a desired velocity profile is achieved. This amounts to the solution of a PDE constrained optimization problem with the state equation given by the Stokes system and the design variables being the control points of a Bézier curve representation of the la...

متن کامل

Q - Superlinear Convergence O F Primal - Dual Interior Point Quasi - Newton Methods F O R Constrained Optimization

This paper analyzes local convergence rates of primal-dual interior point methods for general nonlinearly constrained optimization problems. For this purpose, we first discuss modified Newton methods and modified quasi-Newton methods for solving a nonlinear system of equations, and show local and Qquadratic/Q-superlinear convergence of these methods. These methods are characterized by a perturb...

متن کامل

An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function

In this paper, we&nbsp;consider convex quadratic semidefinite optimization problems and&nbsp;provide a primal-dual Interior Point Method (IPM) based on a new&nbsp;kernel function with a trigonometric barrier term. Iteration&nbsp;complexity of the algorithm is analyzed using some easy to check&nbsp;and mild conditions. Although our proposed kernel function is&nbsp;neither a Self-Regular (SR) fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Program.

دوره 117  شماره 

صفحات  -

تاریخ انتشار 2009